Generalized Interactive Algorithm of Multicriteria Optimization*

نویسنده

  • Mariana Vassileva
چکیده

In the interactive algorithms for multicriteria optimization the decision maker (DM) may express his/her preferences among the separate Pareto optimal solutions with the help of the values of the scalarizing problem parameters. The DM must choose the final (most preferred) solution and be responsible for this selection. The interactive methods are the best developed and wide spread methods. This is due to the following advantages:  a small part of the Pareto optimal solutions is generated and evaluated by the DM;  the DM has the possibility to learn with respect to the problem during the process of multicriteria problem solving;  the DM may change (correct) his/her preferences in the process of the multicriteria problem solving;  the DM feels more confident in his/her preferences concerning the final solution of the multicriteria problem. The interactive algorithms developed for solving multicriteria optimization problems are characterized by the following features:  each interactive method is designed for the solving of a given type of problems – linear, nonlinear, integer, etc.; each interactive method is built on the basis of a certain type of scalarizing problem and possesses the specific features of this problem, connected with the possibilities for setting DM’s preferences as well as the type and time for obtaining the currently preferred Pareto optimal solution; the larger part of the interactive algorithms are algorithms, oriented towards learning, and this means that the DM controls the process of the multicriteria problem solving;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Multicriteria Location Problems

This work concerns a special class of multicriteria optimization problems, obtained from a given single-facility multicriteria planar location problem by adding several new cost functions. By means of a decomposition approach, based on the concept of Pareto reducibility, we have developed together with S. Alzorba and Chr. Günther an implementable algorithm for generating efficient solutions of ...

متن کامل

On Interactive Evolutionary Algorithms and Stochastic Mealy Automata

Interactive evolutionary algorithms IEAs are special cases of interactive optimization methods Potential applications range from multicriteria optimization to the support of rapid prototyping in the eld of design In order to provide a theoretical framework to analyze such evolutionary methods the IEAs are formalized as stochastic Mealy automata The potential impacts of such a formalization are ...

متن کامل

Generalized interval-valued intuitionistic fuzzy Hamacher generalized Shapley Choquet integral operators for multicriteria decision making

The interval-valued intuitionistic fuzzy set (IVIFS) which is an extension of the Atanassov’s intuitionistic fuzzy set is a powerful tool for modeling real life decision making problems. In this paper, we propose the emph{generalized interval-valued intuitionistic fuzzy Hamacher generalized Shapley Choquet integral} (GIVIFHGSCI) and the emph{interval-valued intuitionistic fuzzy Hamacher general...

متن کامل

GENERALIZED FLEXIBILITY-BASED MODEL UPDATING APPROACH VIA DEMOCRATIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR STRUCTURAL DAMAGE PROGNOSIS

This paper presents a new model updating approach for structural damage localization and quantification. Based on the Modal Assurance Criterion (MAC), a new damage-sensitive cost function is introduced by employing the main diagonal and anti-diagonal members of the calculated Generalized Flexibility Matrix (GFM) for the monitored structure and its analytical model. Then, ...

متن کامل

Generalized Scalarizing Problems Gens and Genslex of Multicriteria Optimization1

Generalized scalarizing problems, called GENS and GENSLex, for obtaining Pareto optimal solutions of multicriteria optimization problems are presented in the paper. The basic properties of these scalarizing problems are described. The existence of single-criterion problems with differentiable objective functions and constraints, which are equivalent to GENS and GENSLex scalarizing problems, are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007